Connecting Vertices by Independent Trees

نویسندگان

  • Manu Basavaraju
  • Fedor V. Fomin
  • Petr A. Golovach
  • Saket Saurabh
چکیده

We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and for every two distinct vertices u, v ∈ U , the paths from u to v in T1, . . . , Ts are pairwise vertex disjoint except for end-vertices u and v. Then for a given s ≥ 2 and a parameter k, the task is to decide if a given n-vertex graph G contains a set U of size at least k such that there are s completely independent spanning trees of U . The problem is known to be NP-complete already for s = 2. We prove the following results: For s = 2 the problem is solvable in time 2O(k)nO(1). For s = 2 the problem does not admit a polynomial kernel unless NP ⊆ coNP /poly. For arbitrary s, we show that the problem is solvable in time f(s, k)nO(1) for some function

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Degree Condition of Completely Independent Spanning Trees

Given a graph G, a set of spanning trees of G are completely independent if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. In this paper, we prove that for graphs of order n, with n ≥ 6, if the minimum degree is at least n−2, then there are at least n/3 completely independent spanning trees. Keyword: Completely independ...

متن کامل

Shapes of Binary Trees

max 0≤≤1 ̄̄̄̄  +  − 2 min ≤≤  ̄̄̄̄ if  =∞ We examined k k earlier [2]; h i is a less familiar random variable but nevertheless important in the study of trees. Note that h i is not a norm since, for any constant , hi = 0 even if  6= 0. Let  be an ordered (strongly) binary tree with = 2+1 vertices. The distance between two vertices of  is the number of edges in the shortest p...

متن کامل

On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices

The problem of determining the smallest number of edges, h(n;κ ≥ r), which guarantees that any graph with n vertices and h(n;κ ≥ r) edges will contain a pair of vertices joined by r internally disjoint paths was posed by Erdös and Gallai. Bollobás considered the problem of determining the largest number of edges f(n;κ ≤ `) for graphs with n vertices and local connectivity at most `. One can see...

متن کامل

On extremal graphs with exactly one Steiner tree connecting any $k$ vertices

The problem of determining the largest number f(n; κ ≤ ) of edges for graphs with n vertices and maximal local connectivity at most was considered by Bollobás. Li et al. studied the largest number f(n; κ3 ≤ 2) of edges for graphs with n vertices and at most two internally disjoint Steiner trees connecting any three vertices. In this paper, we further study the largest number f(n; κk = 1) of edg...

متن کامل

Connecting Two Trees with Optimal Routing Cost

We study the problem of finding the optimal connection between two disconnected vertex-weighted trees. We are given a distance function on the vertices and seek to minimize the routing cost of the tree resulting from adding one single edge between the two trees. The routing cost is defined as the sum of the weighted distances between all pairs of vertices in the induced tree-metric. The problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014